So, welcome everybody to the introduction to machine learning first lecture. As you can
see, I am not Vincent Kristlein, I am Mathias Soere, I am replacing him this week because
unfortunately he got corona and he would not like to share it with you, so he will
be staying at home for a few more days. During this lecture he will be taught by
mostly Vincent Kristlein and Paul Stoeve. You will also have, yes he's here in the
front row. You will also have five tutors who will help you a lot with the exercises
both for questions and submissions. And we will start now with just a few
information about the organization of the lecture itself. So it's supposed to be
a bachelor degree course. It's possible that for some tracks we might have some
master students or maybe not, but in theory it's a bachelor degree. The lecture will be
in this auditorium every Wednesday from 8.30 to roughly 10. It is recorded so you
will have also access to the recordings on the FAO TV. Also you will have some
online parts for this lecture. You will have an online Q&A session
managed by Paul. So typically he will present you the exercises and he will
also give some more details about the lecture itself, maybe present some
typical exam questions. So it's always a good idea to attend to his
sessions. For the exercises you will have to do it in groups. We will use a
system called AdoHABEL which is some kind of a curing system that allows
groups to be cured in an efficient way so that the first to come are the first
being served by the tutors. There will be exercise sessions on Monday, Tuesday,
Wednesday and Thursday at various times of the day. And all members of a
single group should be together in one session so groups cannot split over
several days. But yeah maybe just first a few words about the exercises. They will
be done in Python. So far there are five exercises planned. It might change but
that's the current plan. Since you are many students registered to this lecture
it would not be manageable to properly answer questions to everybody so
instead we decided to make groups of three persons. To generate or to
produce the groups you will not assign you to groups. It would be better if you
choose people that you already know or if you go on a stud and there is a forum
you can send some messages on the forum to try to find some group members. But
it's very important that you make sure that all group members can attend to the
same time slot. So that's what was on the previous slide. Exercises are not
mandatory. If you don't want to do them it's up to you. However, there is a small
typo in the slide. However, if you do exercises and if you submit them and if
they are evaluated as done sufficiently well you will get some bonus points for
the exam. So you get bonus points for the exam if you do exercises but also you
get well prepared for the exam. We try to design exercises that are helpful for
passing the exam. To submit the exercise first you will have to pass some
unit tests. So together with a PDF sheet of the exercise and maybe some
data and a bit of code you will get test files which will test different aspects
of your code. We ask you to pass successfully the unit tests on your
computer before you go to the Adorabelle platform for submitting your solution. So
unit tests for the ones who don't know what they are are just a small test cases
for small parts of code like testing the output of a single function. We tried to
design the unit tests to ensure that if a function passes the corresponding tests
then the function is probably correctly implemented. However, as you know there
are so many ways of failing that it's difficult to take all the possibilities
into account when designing tests. So it's still possible that you pass tests
but that there is a small mistake left in the function or in the method that
you have to implement. We hope that it will not happen but just be aware that
Presenters
Zugänglich über
Offener Zugang
Dauer
01:25:22 Min
Aufnahmedatum
2022-04-29
Hochgeladen am
2022-05-02 18:59:04
Sprache
en-US
The goal of this lecture is to familiarize the students with the overall pipeline of a Pattern Recognition System. The various steps involved from data capture to pattern classification are presented. The lectures start with a short introduction, where the nomenclature is defined. Analog to digital conversion is briefly discussed with a focus on how it impacts further signal analysis. Commonly used preprocessing methods are then described. A key component of Pattern Recognition is feature extraction. Thus, several techniques for feature computation will be presented including Walsh Transform, Haar Transform, Linear Predictive Coding, Wavelets, Moments, Principal Component Analysis and Linear Discriminant Analysis. The lectures conclude with a basic introduction to classification. The principles of statistical, distribution-free and nonparametric classification approaches will be presented. Within this context we will cover Bayesian and Gaussian classifiers. The accompanying exercises will provide further details on the methods and procedures presented in this lecture with particular emphasis on their application.
Literature- lecture notes
-
H. Niemann: Klassifikation von Mustern
-
H. Niemann: Pattern Analysis and Understanding
-
S. Theodoridis and K. Koutroumbas: Pattern Recognition, 4th ed., Academic Press, 2009.